Optimal Play of the Farkle Dice Game
نویسندگان
چکیده
We present and solve optimality equations for the 2-player, jeopardy dice game Farkle (a.k.a. Dix Mille, Ten Thousand). For fairest play, we recommend 200 compensation points at the beginning of the game for the second player. We then compute the strategy that maximizes expected score, demonstrate a means for replicating such play with mental mathematics, and augment this method so as to enable human Farkle play against which complex optimal play maintains only a small win advantage of ∼1.7754%.
منابع مشابه
MATHEMATICAL MODELLING FOR DICE FINDER GAME PROBLEM
Play is often episodic and mission-centric, with a series of challenges culminating in a final puzzle or enemy that must be overcome. Multiple missions played with the same characters may be related to each other in a plot arc of escalating challenges. The exact tone, structure, pace and end (if any) vary from game to game depending on the needs and preferences of the players, as in [9]. "THE C...
متن کاملOptimal Play of the Dice Game Pig
The object of the jeopardy dice game Pig is to be the first player to reach 100 points. Each player's turn consists of repeatedly rolling a die. After each roll, the player is faced with two choices: roll again, or hold (decline to roll again). • If the player rolls a 1, the player scores nothing and it becomes the opponent's turn. • If the player rolls a number other than 1, the number is adde...
متن کاملEndgame Strategies and Simulation Results for the Liar’s Dice Game
The Liar’s dice is a dice game where deception and the ability to detect the opponents’ deception play a crucial role. We analyze this game from different perspectives. First, two-player endgames are analyzed and optimal strategies are calculated. Second, using simulation methods, we examine heuristic playing strategies based on their success against each other. In the simulations, we consider ...
متن کاملDynamic decision making and race games
Frequent criticism in dynamic decision making research pertains to the overly complex nature of the decision tasks used in experimentation. To address such concerns we study dynamic decision making with respect to the simple race game Hog, which has a computable optimal decision strategy. In the two-player game of Hog, individuals compete to be the first to reach a designated threshold of point...
متن کاملOptimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, σ) dice game, two players can independently choose a dice from a collection of hypothetical dice having n faces and with a total of σ eyes distributed over these faces. They independently roll their dice and the player showing the highest number of eyes wins (in case of a tie, none of the pl...
متن کامل